Inductive Logic Programming: Issues, Results and the LLL Challenge (abstract)

نویسنده

  • Stephen Muggleton
چکیده

Inductive Logic Programming (ILP) [9, 11] is the area of AI which deals with the induction of hypothesised predicate definitions from examples and background knowledge. Logic programs are used as a single representation for examples, background knowledge and hypotheses. ILP is differentiated from most other forms of Machine Learning (ML) both by its use of an expressive representation language and its ability to make use of logically encoded background knowledge. This has allowed successful applications of ILP [1] in areas such as molecular biology [12, 10, 6, 5] and natural language [7, 3, 2] which both have rich sources of background knowledge and both benefit from the use of an expressive concept representation languages. For instance, the ILP system Progol has recently been used to generate comprehensible descriptions of the 23 most populated fold classes of proteins [14], where no such descriptions had previously been formulated manually. In the natural language area ILP has not only been shown to have higher accuracies than various other ML approaches in learning the past tense of English [8] but also shown to be capable of learning accurate grammars which translate sentences into deductive database queries [15]. In both cases, follow up studies [13, 4] have shown that these ILP approaches to natural language problems extend with relative ease to various languages other than English. The area of Learning Language in Logic (LLL) is producing a number of challenges to existing ILP theory and implementations. In particular, language applications of ILP require revision and extension of a hierarchically defined set of predicates in which the examples are typically only provided for predicates at the top of the hierarchy. New predicates often need to be invented, and complex recursion is usually involved. Similarly the term structure of semantic objects is far more complex than in other applications of ILP. Advances in ILP theory and implementation related to the challenges of LLL are already producing beneficial advances in other sequenceoriented applications of ILP. In addition LLL is starting to develop its own character as a sub-discipline of AI involving the confluence of computational linguistics, machine learning and logic programming.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Inductive Logic Programming: Issues, Results and the Challenge of Learning Language in Logic

Inductive Logic Programming (ILP) is the area of AI which deals with the induction of hypothesised predicate deenitions from examples and background knowledge. Logic programs are used as a single representation for examples, background knowledge and hypotheses. ILP is diierentiated from most other forms of Machine Learning (ML) both by its use of an expressive representation language and its ab...

متن کامل

An Introduction to Inductive Logic Programming and Learning Language in Logic

This chapter introduces Inductive Logic Programming (ILP) and Learning Language in Logic (LLL). No previous knowledge of logic programming, ILP or LLL is assumed. Elementary topics are covered and more advanced topics are discussed. For example, in the ILP section we discuss subsumption, inverse resolution, least general generalisation, relative least general generalisation, inverse entailment,...

متن کامل

Representational/Efficiency Issues in Toxicological Knowledge Discovery

We tackle the problem of automatic detection of StructureActivity relationships by means of Inductive Logic Programming (ILP). We describe an algorithm for constructing features from background knowledge (stochastic propositionalization SP) and an abstract level representation for chemical compounds.

متن کامل

Low Size-Complexity Inductive Logic Programming: The East-West Challenge Considered as a Problem in Cost-Sensitive Classification

The Inductive Logic Programming community has considered proof-complexity and model-complexity, but, until recently, size-complexity has received little attention. Recently a challenge was issued “to the international computing community” to discover low size-complexity Prolog programs for classifying trains. The challenge was based on a problem first proposed by Ryszard Michalski, 20 years ago...

متن کامل

Incorporating Linguistics Constraints into Inductive Logic Programming

We report work on effectively incorporating linguistic knowledge into grammar induction. We use a highly interactive bot tom-up inductive logic programming (ILP) algorithm to learn 'missing' grammar rules from an :incomplete grammar. Using linguistic constraints on, for example, head features and gap threading, reduces the search space to such an extent that, in the small-scale experiments repo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998